GRASP-VNS hybrid for the Strip Packing Problem
نویسندگان
چکیده
In this work we consider an hybrid metaheuristic approach to solve the Strip Packing Problem. In the hybrid algorithm, we use an Variable Neighbourhood Search (VNS) to improve the quality of part of the solution obtained with a Greedy Randomized Adaptive Search Procedure (GRASP). Then, the results achieved with the hybrid method are compared with those existing in the literature. From these results, we can conclude the goodness of our proposal.
منابع مشابه
Solving the Rectangle Packing Problem by an Iterative Hybrid Heuristic
In this paper we propose an iterative hybrid heuristic approach consisting of two phases to solve the Rectangle Packing Problem. In the first phase, a strip width value W is fixed and the corresponding Strip Packing Problem is solved using an efficient hybrid GRASP-VNS heuristic. In the second one, a new value W is determined. The above phases are repeated until the stopping condition is met. T...
متن کاملA new metaheuristic genetic-based placement algorithm for 2D strip packing
Given a container of fixed width, infinite height and a set of rectangular block, the 2D-strip packing problem consists of orthogonally placing all the rectangles such that the height is minimized. The position is subject to confinement of no overlapping of blocks. The problem is a complex NP-hard combinatorial optimization, thus a heuristic based on genetic algorithm is proposed to solve it. I...
متن کاملA Comparative Study of Exact Algorithms for the Two Dimensional Strip Packing Problem
In this paper we consider a two dimensional strip packing problem. The problem consists of packing a set of rectangular items in one strip of width W and infinite height. They must be packed without overlapping, parallel to the edge of the strip and we assume that the items are oriented, i.e. they cannot be rotated. To solve this problem, we use three exact methods: a branch and bound method, a...
متن کاملMetaheuristics International Conference ? ? - 1 GRASP heuristic for the strip packing problem ∗
The rectangular Strip Packing Problem (SPP) consists of packing a given set of rectangles in a rectangular strip with fixed width w and variable height minimizing the height of the packing. In this work we propose a ”Greedy Randomized and Adaptive Constructive” heuristic, a GRASP metaheuristic without the post-processing phase, for the SPP in the version where the rectangles can be freely rotat...
متن کاملGRASP-VNS for a Periodic VRP with Time Windows to Deal with Milk Collection
This paper considers the planning of the collection of fresh milk from local farms with a fleet of refrigerated vehicles. The problem is formulated as a version of the Periodic Vehicle Routing Problem with Time Windows. The objective function is oriented to the quality of service by minimizing the service times to the customers within their time windows. We developed a hybrid metaheuristic that...
متن کامل